Investigation of the * (Star) Search Algorithms: Characteristics, Methods and Approaches
نویسندگان
چکیده
In this study, a branch of search algorithms that are called * (star) algorithms is taken to look. Star algorithms have different types and derivatives. They are A*, B*, D* (including original D*, Focused D* and D* Lite), IDA* and SMA*. Features, basic concepts, algorithm and the approaches of each type is investigated separately in this paper.
منابع مشابه
A New Method for Forecasting Uniaxial Compressive Strength of Weak Rocks
The uniaxial compressive strength of weak rocks (UCSWR) is among the essential parameters involved for the design of underground excavations, surface and underground mines, foundations in/on rock masses, and oil wells as an input factor of some analytical and empirical methods such as RMR and RMI. The direct standard approaches are difficult, expensive, and time-consuming, especially with highl...
متن کاملArmentum: a hybrid direct search optimization methodology
Design of experiments (DOE) offers a great deal of benefits to any manufacturing organization, such as characterization of variables and sets the path for the optimization of the levels of these variables (settings) trough the Response surface methodology, leading to process capability improvement, efficiency increase, cost reduction. Unfortunately, the use of these methodologies is very limite...
متن کاملNew Approaches in Metaheuristics to Solve the Truck Scheduling Problem in a Cross-docking Center
Nowadays, cross-docking is one of the main concepts in supply chain management in which products received to a distribution center by inbound trucks which are directly to lead into outbound trucks with a minimum handling and storage costs as the main cost of a cross-docking system. According to the literature, several metaheuristics and heuristics are attempted to solve this optimization model....
متن کاملGENETIC AND TABU SEARCH ALGORITHMS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH SEQUENCE-DEPENDENT SET-UP TIMES AND DETERIORATING JOBS
This paper introduces the effects of job deterioration and sequence dependent set- up time in a single machine scheduling problem. The considered optimization criterion is the minimization of the makespan (Cmax). For this purpose, after formulating the mathematical model, genetic and tabu search algorithms were developed for the problem. Since population diversity is a very important issue in ...
متن کاملA partition-based algorithm for clustering large-scale software systems
Clustering techniques are used to extract the structure of software for understanding, maintaining, and refactoring. In the literature, most of the proposed approaches for software clustering are divided into hierarchical algorithms and search-based techniques. In the former, clustering is a process of merging (splitting) similar (non-similar) clusters. These techniques suffered from the drawba...
متن کامل